On mixing times for stratified walks on the d-cube
نویسندگان
چکیده
Using the electric and coupling approaches, we derive a series of results concerning the mixing times for the stratified random walk on the d-cube, inspired in the results of Chung and Graham (1997) Stratified random walks on the n-cube. Random Structures and Algorithms, 11,199-222.
منابع مشابه
Stratified random walks on the n-cube
In this paper we present a method for analyzing a general class of random Ž . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to Ž . guarantee that the resulting distrib...
متن کاملStratiied Random Walks on the N-cube
In this paper we present a method for analyzing a general class of ramdom walks on the n-cube (and certain subgraphs of it). These walks all have the property that the transition probabilities depend only on the level of the point the walk is at. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to guarantee that the resulting distribution is clos...
متن کاملStratiied Random Walks on the N-cube
In this paper we present a method for analyzing a general class of ramdom walks on the n cube and certain subgraphs of it These walks all have the property that the transition probabilities depend only on the level of the point the walk is at For these walks we derive sharp bounds on their mixing rates i e the number of steps required to guarantee that the resulting distribution is close to the...
متن کاملRandom Walks on Groups: Strong Uniform Time Approach
In this work we develop further and apply the strong uniform time approach for study of the random walks on finite groups. This approach was introduced by Aldous and Diaconis in [AD1,2] and later developed by Diaconis and Fill in [DF]. Consider a random walk on a finite group. We introduce a notion of total separation for this walk which can be thought as a new measure of how fast the walk is m...
متن کاملRandom random walks on Z d 2
We consider random walks on classes of graphs de®ned on the ddimensional binary cube Zd2 by placing edges on n randomly chosen parallel classes of vectors. The mixing time of a graph is the number of steps of a random walk before the walk forgets where it started, and reaches a random location. In this paper we resolve a question of Diaconis by ®nding exact expressions for this mixing time that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 20 شماره
صفحات -
تاریخ انتشار 2002